Optimal Semi-Iterative Methods for Complex SOR with Results from Potential Theory
نویسندگان
چکیده
We consider the application of semi-iterative methods (SIM) to the standard (SOR) method with complex relaxation parameter ω, under the following two assumptions: (1) the associated Jacobi matrix J is consistently ordered and weakly cyclic of index 2, and (2) the spectrum σ(J ) of J belongs to a compact subset of the complex plane C, which is symmetric with respect to the origin. By using results from potential theory, we determine the region of optimal choice of ω ∈ C for the combination SIM–SOR and settle, for a large class of compact sets , the classical problem of characterising completely all the cases for which the use of the SIM-SOR is advantageous over the sole use of SOR, under the hypothesis that σ(J ) ⊂ . In particular, our results show that, unless the outer boundary of is an ellipse, SIM–SOR is always better and, furthermore, one of the best possible choices is an asymptotically optimal SIM applied to the Gauss–Seidel method. In addition, we derive the optimal complex SOR parameters for all ellipses which are symmetric with respect to the origin. Our work was motivated by recent results of M. Eiermann and R.S. Varga. Dedicated to Professor Richard S. Varga in recognition of his substantial contributions to the subject of the paper. A. Hadjidimos Department of Mathematics, University of Crete, P.O. Box 2208, 714 09 Heraklion, Greece E-mail: [email protected] N.S. Stylianopoulos (B) Department of Mathematics and Statistics, University of Cyprus, P.O. Box 20537, 1678 Nicosia, Cyprus E-mail: [email protected] 592 A. Hadjidimos, N.S. Stylianopoulos
منابع مشابه
A General Theory of Optimal p-Cyclic SOR
The convergence theory of the Successive Overrelaxation (SOR) iterative method for the solution of nonsingular linear systems Ax = b, when the matrix A has a block p X P partitioned p-cyclic form, is well documented. However, when A is singular the corresponding theory is far behind that for the nonsingular case. Our purpose in this paper is to extend the p-cyclic SOR theory to consistent singu...
متن کاملOptimum parameter for the SOR-like method for augmented systems
Recently, several proposals for the generalization of Young’s SOR method to the saddle point problem or the augmented system has been presented. One of the most practical versions is the SOR-like method given by Golub et al., [(2001). SOR-like methods for augmented systems. BIT, 41, 71–85.], where the convergence and the determination of its optimum parameters were given. In this article, a ful...
متن کاملComparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems
Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...
متن کاملGeneralized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملBlock SOR methods for rank-de cient least-squares problems
Many papers have discussed preconditioned block iterative methods for solving full rank least-squares problems. However very few papers studied iterative methods for solving rank-de cient least-squares problems. Miller and Neumann (1987) proposed the 4-block SOR method for solving the rank-de cient problem. Here a 2-block SOR method and a 3-block SOR method are proposed to solve such problem. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerische Mathematik
دوره 103 شماره
صفحات -
تاریخ انتشار 2006